Whenever data is arranged in a network, graphs are the language of choice to represent the data. Examples are the street layout in a city that may be used in routing problems, or relationships in a social network, or dependencies in a software project. In this course we study the theoretical properties of graphs. Apart from the many applications of graphs, they turn out to be a source of attractive results and open problems.

Professor: Henning Bruhn-Fujimoto

Teaching Assistant: Laura Gellert

Time and Place:  We 12-14 in He22E04 and Th 14-16 in He18E60, exercises Mo 16-18 in He18E60

Literature:

• Reinhard Diestel, Graph Theory (Springer)
• Adrian Bondy and U.S.R. Murty, Graph Theory (Springer)